Carries, Group Theory, and Additive Combinatorics

نویسندگان

  • Persi Diaconis
  • Xuancheng Shao
  • Kannan Soundararajan
چکیده

When numbers are added in the usual way carries occur along the route. These carries cause a mess and it is natural to seek ways to minimize them. This paper proves that balanced arithmetic minimizes the proportion of carries. It also positions carries as cocycles in group theory and shows that if coset representatives for a finite-index normal subgroup H in a group G can be chosen so that the proportion of carries is less than 2/9, then there is a choice of coset representatives where no carries are needed (in other words, the extension splits). Finally, our paper makes the link between the problems above and the emerging field of additive combinatorics. Indeed the tools and techniques of this field are used in our proofs, and our examples provide an elementary introduction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive Combinatorics: With a View Towards Computer Science and Cryptography - An Exposition

Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define – perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which are used there. One might say that additive combinatorics is a branch of mathematics concerning the study of additive structures in sets equipped with a grou...

متن کامل

Additive Combinatorics and Theoretical Computer Science ∗ Luca Trevisan

Additive combinatorics is the branch of combinatorics where the objects of study are subsets of the integers or of other abelian groups, and one is interested in properties and patterns that can be expressed in terms of linear equations. More generally, arithmetic combinatorics deals with properties and patterns that can be expressed via additions and multiplications. In the past ten years, add...

متن کامل

Additive Combinatorics and its Applications in Theoretical Computer Science

Additive combinatorics (or perhaps more accurately, arithmetic combinatorics) is a branch of mathematics which lies at the intersection of combinatorics, number theory, Fourier analysis and ergodic theory. It studies approximate notions of various algebraic structures, such as vector spaces or fields. In recent years, several connections between additive combinatorics and theoretical computer s...

متن کامل

Groups in Combinatorial Number Theory

In combinatorial number theory, there are many topics related to group structure. Even for abelian or cyclic groups, there are some very challenging unsolved conjectures. In this talk we give a survey of problems, results and methods in several fields of combinatorial number theory. The topics include sumsets in additive combinatorics, Snevily’s conjecture and Latin transversals, covers of the ...

متن کامل

Topology of Cayley graphs applied to inverse additive problems

We present the basic isopermetric structure theory, obtaining some new simplified proofs. Let 1 ≤ r ≤ k be integers. As an application, we obtain simple descriptions for the subsets S of an abelian group with |kS| ≤ k|S|−k+1 or |kS−rS|−(k+r)|S|, where where S denotes as usual the Minkowski sum of copies of S. These results may be applied to several questions in Combinatorics and Additive Combin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • The American Mathematical Monthly

دوره 121  شماره 

صفحات  -

تاریخ انتشار 2014